The Bounded Degree Problem for NLC Grammars is Decidable
نویسندگان
چکیده
The degree qj’a graph H is the maximum among the degrees of its nodes. A set of graphs L is of bounded degree if there exists a positive integer n such that the degree of each graph in L does not exceed n. We demonstrate that it is decidable whether or not the (graph) language of an arbitrary node label controlled (NLC) grammar is of bounded degree. Moreover, it is shown that, given an arbitrary NLC grammar G generating the language L(G) of bounded degree, one can effectively compute the maximum integer which appears as the degree of a graph in L(G). (‘ 1986 Academic Press. Inc
منابع مشابه
Pattern Language Recognition and Generation
A k-bounded recognizable pattern language is the set of all k-bounded patterns that are obtained as behaviors of a pattern automaton. The emptiness and the equality problems for k-bounded behaviors of pattern automata are proved to be decidable. Moreover, we examine their relationship with context free pattern grammars, which are basically the hyperedge replacement grammars on planar directed a...
متن کاملDecidable Boundedness Problems for Sets of Graphs Generated by Hyperedge-Replacement
Habel, A., H.-J. Kreowski and W. Vogler, Decidable boundedness problems for sets of graphs generated by hyperedge-replacement, Theoretical Computer Science 89 (1991) 33-62. Consider a class GZ of hyperedge-replacement graph grammars and a numeric function on graphs like the number of edges, the degree (i.e., the maximum of the degrees of all nodes of a graph), the number of simple paths, the si...
متن کاملDecidable Boundedness Problems for Hyperedge-Replacement Graph Grammar
Consider a class C of hyperedge--replacement graph grammars and a numeric function on graphs like the number of edges, the degree (i.e., the maximum of the degrees of all nodes of a graph), the number of simple paths, the size of a maximum set of independent nodes, etc. Each such function induces a Boundedness Problem for the class C: Given a grammar HRG in C, are the function values of all gra...
متن کاملOn the complexity of Bounded Second-Order Unification and Stratified Context Unification
Bounded Second-Order Unification is a decidable variant of undecidable Second-Order Unification. Stratified Context Unification is a decidable restriction of Context Unification, whose decidability is a long-standing open problem. This paper is a join of two separate previous, preliminary papers on NP-completeness of Bounded Second-Order Unification and Stratified Context Unification. It clarif...
متن کاملOn the Complexity of Bounded Second-order Unification and Stratified Context Unification
Bounded Second-Order Unification is a decidable variant of undecidable Second-Order Unification. Stratified Context Unification is a decidable restriction of Context Unification, whose decidability is a long-standing open problem. This paper is a join of two separate previous, preliminary papers on NP-completeness of Bounded Second-Order Unification and Stratified Context Unification. It clarif...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 33 شماره
صفحات -
تاریخ انتشار 1986